Generalized petersen graphs which are cycle permutation graphs
نویسندگان
چکیده
منابع مشابه
The Target Set Selection Problem on Cycle Permutation Graphs, Generalized Petersen Graphs and Torus Cordalis
In this paper we consider a fundamental problem in the area of viral marketing, called TARGET SET SELECTION problem. In a a viral marketing setting, social networks are modeled by graphs with potential customers of a new product as vertices and friend relationships as edges, where each vertex v is assigned a threshold value θ(v). The thresholds represent the different latent tendencies of custo...
متن کاملGraceful labelings of the generalized Petersen graphs
A graceful labeling of a graph $G=(V,E)$ with $m$ edges is aninjection $f: V(G) rightarrow {0,1,ldots,m}$ such that the resulting edge labelsobtained by $|f(u)-f(v)|$ on every edge $uv$ are pairwise distinct. For natural numbers $n$ and $k$, where $n > 2k$, a generalized Petersengraph $P(n, k)$ is the graph whose vertex set is ${u_1, u_2, cdots, u_n} cup {v_1, v_2, cdots, v_n}$ and its edge set...
متن کاملAll generalized Petersen graphs are unit-distance graphs
In 1950 a class of generalized Petersen graphs was introduced by Coxeter and around 1970 popularized by Frucht, Graver and Watkins. The family of I-graphs mentioned in 1988 by Bouwer et al. represents a slight further albeit important generalization of the renowned Petersen graph. We show that each I-graph I(n, j, k) admits a unit-distance representation in the Euclidean plane. This implies tha...
متن کاملOptimal Generalized Petersen Graphs
In this paper we establish a theorem on the maximum number of vertices of a generalized Petersen graph as a function of the diameter.
متن کاملHyper-Hamiltonian generalized Petersen graphs
Assume that n and k are positive integers with n ≥ 2k + 1. A non-hamiltonian graph G is hypo hamiltonian if G − v is hamiltonian for any v ∈ V (G). It is proved that the generalized Petersen graph P (n, k) is hypo hamiltonian if and only if k = 2 and n ≡ 5 (mod 6). Similarly, a hamiltonian graph G is hyper hamiltonian if G−v is hamiltonian for any v ∈ V (G). In this paper, we will give some nec...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Combinatorial Theory, Series B
سال: 1984
ISSN: 0095-8956
DOI: 10.1016/0095-8956(84)90068-6